Scaled Group Consensus over Weakly Connected Structurally Balanced Graphs
نویسندگان
چکیده
منابع مشابه
Balanced group-labeled graphs
A group-labeled graph is a graph whose vertices and edges have been assigned labels from some abelian group. The weight of a subgraph of a group-labeled graph is the sum of the labels of the vertices and edges in the subgraph. A group-labeled graph is said to be balanced if the weight of every cycle in the graph is zero. We give a characterization of balanced group-labeled graphs that generaliz...
متن کاملStrong weakly connected domination subdivisible graphs
The weakly connected domination subdivision number sdγw(G) of a connected graph G is the minimum number of edges which must be subdivided (where each edge can be subdivided at most once) in order to increase the weakly connected domination number. The graph is strongγw-subdivisible if for each edge uv ∈ E(G) we have γw(Guv) > γw(G), where Guv is a graph G with subdivided edge uv. The graph is s...
متن کاملA characterization of weakly four-connected graphs
A graph G = (V, E) is called weakly four-connected if G is 4-edge-connected and G − x is 2-edge-connected for all x ∈ V . We give sufficient conditions for the existence of ‘splittable’ vertices of degree four in weakly four-connected graphs. By using these results we prove that every minimally weakly fourconnected graph on at least four vertices contains at least three ‘splittable’ vertices of...
متن کاملOn weakly connected domination in graphs
Let G = (V,E) be a connected undirected graph. For any vertex v ∈ V , the closed neighborhood of v is N [v] = {v} ∪ {u ∈ V | uv ∈ E }. For S ⊆ V , the closed neighborhood of S is N [S] = ⋃ v∈S N [v]. The subgraph weakly induced by S is 〈S〉w = (N [S], E ∩ (S × N [S])). A set S is a weakly-connected dominating set of G if S is dominating and 〈S〉w is connected. The weakly-connected domination numb...
متن کاملRemarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2020
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2020.12.995